Solving the Multiple Traveling Salesman Problem Using Memetic Algorithm

The Multiple Traveling Salesman Problem (MTSP) is considered as an NP-complete problem due to the difficulty of finding shortest tour between different cities with a set constraints such visiting each city once by one salesman. solution represents sum all tours' costs performed n salesmen. In this research, we propose novel approach find solutions for various instances MTSP based on memetic algorithm using Genetic Algorithm (GA) and Hill-Climbing (HC) algorithm. experimental results proved that achieved promising i.e., minimum total compared other existing approaches.